Pre-, In- and Postfix grammars for Symbolic Regression in Grammatical Evolution

نویسندگان

  • Erik Hemberg
  • Nicholas McPhee
  • Michael O’Neill
  • Anthony Brabazon
چکیده

Recent research has indicated that grammar design is an important consideration when using grammar-based Genetic Programming, particularly with respect to unintended biases that may arise through rule ordering or duplication. In this study we examine how the ordering of the elements during mapping can impact performance. Here we use to the standard GE depth-first mapper and compare the performance of postfix, prefix and infix grammars on a selection of symbolic regression problem instances. We show that postfix can confer a performance advantage on the harder problems examined.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Developing Postfix-GP Framework for Symbolic Regression Problems

This paper describes Postfix-GP system, postfix notation based Genetic Programming (GP), for solving symbolic regression problems. It presents an object-oriented architecture of Postfix-GP framework. It assists the user in understanding of the implementation details of various components of Postfix-GP. Postfix-GP provides graphical user interface which allows user to configure the experiment, t...

متن کامل

Application of Improved Grammatical Evolution to Stock Price Prediction

Grammatical Evolution (GE), which is one of the evolutionary computations, aims to find function, program or program segment satisfying the design objective. This paper describes the improvement of the Grammatical Evolution according to Stochastic Schemata Exploiter (GE-SSE) and its application to symbolic regression problem. Firstly, GE-SSE is compared with original GE in symbolic regression p...

متن کامل

Grammatical Evolution: A Steady State approach

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern the mapping of a Backus Naur Form grammar definition to a program, expressions and programs of arbitrary complexity may be evolved. Our system, Grammatical Evolution, has been applied to problems such as a Symbolic Regression problem, and finding Trigonometric Identities. In this p...

متن کامل

Automated Conjecturing of Frobenius Numbers via Grammatical Evolution

Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from faster conjecturing but also from finding conjectures previously out of our grasp. Grammatical evolution, a genetic programming technique, can be used for automated conjecturing in mathematics. Concretely, this work describes ...

متن کامل

Grammatical Evolution: Evolving Programs for an Arbitrary Language

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar deenition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, Grammatical Evolution, is applied to a symbolic regression problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008